When strictly locally convex hypersurfaces are embedded
نویسندگان
چکیده
منابع مشابه
Affine complete locally convex hypersurfaces
An open problem in affine geometry is whether an affine complete locally uniformly convex hypersurface in Euclidean (n + 1)-space is Euclidean complete for n ≥ 2. In this paper we give the affirmative answer. As an application, it follows that an affine complete, affine maximal surface in R3 must be an elliptic paraboloid.
متن کاملOn Locally Convex Hypersurfaces with Boundary
In this paper we give some geometric characterizations of locally convex hypersurfaces. In particular, we prove that for a given locally convex hypersurface M with boundary, there exists r > 0 depending only on the diameter of M and the principal curvatures of M on its boundary, such that the r-neighbourhood of any given point on M is convex. As an application we prove an existence theorem for ...
متن کاملSocial Welfare Functions When Preferences Are Convex, Strictly Monotonic, and Continuous
The paper shows that if the class of admissible preference orderings i restricted in a manner appropriate for economic and political models, then Arrow's impossibility theorem for social welfare functions continues to be valid. Specifically if the space of alternatives i R n, n > 3, where each dimension represents a different public good and if each person's preferences are restricted to be con...
متن کاملStrictly Convex Corners Scatter
We prove the absence of non-scattering energies for potentials in the plane having a corner of angle smaller than π. This extends the earlier result of Bl̊asten, Päivärinta and Sylvester who considered rectangular corners. In three dimensions, we prove a similar result for any potential with a circular conic corner whose opening angle is outside a countable subset of (0, π).
متن کاملMinimum Strictly Convex Quadrangulations of Convex
We present a linear{time algorithm that decomposes a convex polygon conformally into a minimum number of strictly convex quadrilaterals. Moreover, we characterize the polygons that can be decomposed without additional vertices inside the polygon, and we present a linear{time algorithm for such decompositions, too. As an application , we consider the problem of constructing a minimum conformal r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematische Zeitschrift
سال: 2011
ISSN: 0025-5874,1432-1823
DOI: 10.1007/s00209-011-0904-9